Utilization Bound of Non-preemptive Fixed Priority Schedulers
نویسندگان
چکیده
منابع مشابه
Engineering and Analysis of Fixed Priority Schedulers
| Scheduling theory holds great promise as a means to a priori validate timing correctness of real-time applications. However, there currently exists a wide gap between scheduling theory and its implementation in operating system kernels running on speci c hardware platforms. The implementation of any particular scheduling algorithm introduces overheadand blocking components whichmust be accoun...
متن کاملBandwidth Utilization in Sorted-Priority Schedulers
This paper first introduces bandwidth utilization metric and then analyzes sorted-priority schedulers in the terms of the metric. The results show that the utilization is directly proportional to both the number of delay bound classes and the dependency of delay bound on rate but inversely proportional to packet size.
متن کاملEfficient Alternatives for Implementing Fixed-Priority Schedulers
Fixed-priority schedulers received a lot of attention from the real-time community, and a big effort has been performed to develop accurate and more general schedulability analysis that can ensure the correct execution of the system. Nevertheless, only few works analysed the overhead and blocking intervals introduced by the scheduler and the associated kernel routines, modifying the schedulabil...
متن کاملFixed-Priority Multiprocessor Scheduling: Beyond Liu & Layland Utilization Bound
The increasing interests in multicores raise the question whether established results on uniprocessor scheduling, in particular, the various utilization bounds for schedulability test used in system design, can be generalized to the multiprocessor setting. Recently, this has been shown for the famous Liu and Layland utilization bound by applying novel task splitting techniques. However, paramet...
متن کاملFixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound
Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.2152